Path graph - PDFSEARCH.IO - Document Search Engine

Path graph
Results: 1083

#	Item
401	arXiv:1401.2906v3 [math.CO] 18 AugAN Lp THEORY OF SPARSE GRAPH CONVERGENCE I: LIMITS, SPARSE RANDOM GRAPH MODELS, AND POWER LAW DISTRIBUTIONS CHRISTIAN BORGS, JENNIFER T. CHAYES, HENRY COHN, AND YUFEI ZHAO Add to Reading List Source URL: arxiv.org Language: English - Date: 2014-08-18 20:27:12 Graph Dense graph Szemerédi regularity lemma Planar separator theorem Path decomposition Graph theory Mathematics Random graph
402	Building Rich Internet Applications Models: Example of a Better Strategy Suryakant Choudhary1 , Mustafa Emre Dincturk1 , Seyed M. Mirtaheri1 , Guy-Vincent Jourdan1,2 , Gregor v. Bochmann1,2 , and Iosif Viorel Onut3,4 1 Add to Reading List Source URL: ssrg.site.uottawa.ca Language: English - Date: 2013-04-30 15:56:24 Web crawler Model-based testing Shortest path problem Rich Internet application Graph Graph theory Mathematics Theoretical computer science
403	C:/cygwin/research/homotopic/james-journal/paper.dvi Add to Reading List Source URL: www.cs.ust.hk Language: English - Date: 2011-01-03 01:07:02 Network theory Shortest path problem Induced path Geodesic SL Routing algorithms Matching Graph theory Theoretical computer science Mathematics
404	Algorithmic complexity of finding cross-cycles in flag complexes Michal Adamaszek, Juraj Stacho University of Warwick, UK Centre for Discrete Mathematics and its Applications (DIMAP) Add to Reading List Source URL: www.mimuw.edu.pl Language: English - Date: 2015-03-23 03:34:03 Algebraic topology Chordal graph Clique complex Graph Vietoris–Rips complex CW complex Induced path Maximal independent set Simplicial complex Graph theory Mathematics Topology
405	New Races in Parameterized Algorithmics Christian Komusiewicz and Rolf Niedermeier Institut f¨ ur Softwaretechnik und Theoretische Informatik, TU Berlin, Germany {christian.komusiewicz,rolf.niedermeier}@tu-berlin.de Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2012-08-07 06:26:48 NP-complete problems Parameterized complexity Kernelization Path decomposition Vertex cover Feedback vertex set Dominating set Tree decomposition Clique Graph theory Theoretical computer science Mathematics
406	Bandwidth Approximation of a Restricted Family of Trees Abstract Bandwidth is one of the canonical NP-complete problemsIt is NP-hard to approximate within any constant, even on treesGupta gave a randomized Add to Reading List Source URL: www.cs.toronto.edu Language: English - Date: 2009-12-02 23:05:21 NP-complete problems Tree Clique Path decomposition Graph coloring Graph theory Theoretical computer science Mathematics
407	C:/cygwin/research/homotopic/james-journal/paper.dvi Add to Reading List Source URL: www.cs.ust.hk Language: English - Date: 2011-01-03 01:07:02 Network theory Shortest path problem Induced path Geodesic SL Routing algorithms Matching Graph theory Theoretical computer science Mathematics
408	1 In-Core Computation of Geometric Centralities with HyperBall: A Hundred Billion Nodes and Beyond Paolo Boldi Add to Reading List Source URL: vigna.di.unimi.it Language: English - Date: 2013-08-12 06:22:34 Theoretical computer science Networks Network analysis Algebraic graph theory Centrality Shortest path problem Network science Power graph analysis Graph theory Mathematics Network theory
409	Lower Bounds for (Weak) Sense of Direction Paolo Boldi∗ Sebastiano Vigna∗ Abstract Add to Reading List Source URL: vigna.di.unimi.it Language: English - Date: 2002-05-18 04:50:44 Connectivity Representation Graph Cayley graph Path decomposition Universal graph Graph theory Mathematics Matroid theory
410	An Approximation Algorithm for the Disjoint Paths Problem in Even-Degree Planar Graphs Jon Kleinberg ∗ Abstract Add to Reading List Source URL: www.cs.cornell.edu Language: English - Date: 2005-08-11 23:51:43 Tree Graph coloring Minor Path decomposition Planar separator theorem Graph theory Graph operations Planar graph